Fault-ignorant quantum search
نویسندگان
چکیده
منابع مشابه
Ignoring Ignorance Is Ignorant
When prior probabilities are given as data, there is generally little objection to the use of the Bayes formula or Bayesian networks. On the other hand, when prior probabilities are lacking, Bayesians have the tendency to ignore their ignorance and to make the priors up out of thin air. This leads to decisions in situations where gathering more information would be more appropriate. This paper ...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملIgnorant In uence Diagrams
Innuence Diagrams (ids) are a graphic formalism able to provide a compact representation of decision problems. ids are based on the axioms of probability and decision theory, and they deene a normative framework to model decision making. Unfortunately, ids require a large amount of information that is not always available to the decision maker. This paper introduces a new class of ids, called I...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملIgnorant vs. Anonymous Recommendations
We start with an unknown binary n×m matrix, where the entries correspond to the preferences of n users on m items. The goal is to find at least one item per user that the user likes, with as few queries as possible. Since there are matrices where any algorithm performs badly without any preliminary knowledge of the input matrix, we reveal an anonymized version of the input matrix to the algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2014
ISSN: 1367-2630
DOI: 10.1088/1367-2630/16/7/073033